Rounding-based heuristics for nonconvex MINLPs
نویسندگان
چکیده
منابع مشابه
Rounding-based heuristics for nonconvex MINLPs
We propose two primal heuristics for nonconvex mixed-integer nonlinear programs. Both are based on the idea of rounding the solution of a continuous nonlinear program subject to linear constraints. Each rounding step is accomplished through the solution of a mixed-integer linear program. Our heuristics use the same algorithmic scheme, but they differ in the choice of the point to be rounded (wh...
متن کاملExperiments with a Feasibility Pump Approach for Nonconvex MINLPs
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorithms and difficulties arising from nonconvexities in the models are extensively discussed. The main methodological innovations of this variant are: (a) the first subproblem is a nonconvex continuous Nonlinear Program, wh...
متن کاملLaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs
We present a Branch and Cut algorithm of the software package LaGO to solve nonconvex mixed-integer nonlinear programs (MINLPs). A linear outer approximation is constructed from a convex relaxation of the problem. Since we do not require an algebraic representation of the problem, reformulation techniques for the construction of the convex relaxation cannot be applied, and we are restricted to ...
متن کاملColumn Generation based Alternating Direction Methods for solving MINLPs
Traditional decomposition based branch-and-bound algorithms, like branch-and-price, can be very e cient if the duality gap is not too large. However, if this is not the case, the branchand-bound tree may grow rapidly, preventing the method to nd a good solution. In this paper, we present a new decompositon algorithm, called ADGO (Alternating Direction Global Optimization algorithm), for globall...
متن کاملA Local Branching Heuristic for MINLPs
Local branching is an improvement heuristic, developed within the context of branch-and-bound algorithms for MILPs, which has proved to be very effective in practice. For the binary case, it is based on defining a neighbourhood of the current incumbent solution by allowing only a few binary variables to flip their value, through the addition of a local branching constraint. The neighbourhood is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming Computation
سال: 2011
ISSN: 1867-2949,1867-2957
DOI: 10.1007/s12532-011-0032-x